“Reducing” classic to practice: Knowledge representation theory meets reality
نویسندگان
چکیده
منابع مشابه
"Reducing" CLASSIC to Practice: Knowledge Representation Theory Meets Reality
Most recent key developments in research on knowledge representation (KR) have been of the more theoretical sort, involving worstcase complexity results, solutions to technical challenge problems, etc. While some of this work has influenced practice in Artificial Intelligence, it is rarely—if ever—made clear what is compromised when the transition is made from relatively abstract theory to the ...
متن کاملKnowledge Representation and Reasoning Logic meets Probability Theory
Preface to these notes This set of lecture notes gives a brief summary of the basic ideas and principles underlying the lectures given in the course Knowledge Representation and Reasoning. The basic idea underlying the course is that in AI you need to be able to precisely represent knowledge in order to explore that knowledge to solve problems. This is because, in contrast to humans, computers ...
متن کاملKnowledge Representation meets Digital Libraries
In this short paper, the basic ideas behind a project on the application of Knowledge Representation formalisms and technologies for Conceptual Modelling and Query Management are presented. It is argued that good Conceptual Modelling is required to support powerful information access through Intelligent Navigation, a fundamental task in Digital Libraries.
متن کاملSatisfiability: where Theory meets Practice∗
Propositional Satisfiability (SAT) is a keystone in the history of computer science. SAT was the first problem shown to be NP-complete in 1971 by Stephen Cook [4]. Having passed more than 40 years from then, SAT is now a lively research field where theory and practice have a natural intermixing. In this talk, we overview the use of SAT in practical domains, where SAT is thought in a broad sense...
متن کاملLearnability of the Classic Knowledge Representation Language
Much of the work in inductive learning considers languages that represent hypotheses using some restricted form of propositional logic; an important research problem is extending propo-sitional learning algorithms to use more expressive rst-order representations. Further, it is desirable for these algorithms to have solid theoretical foundations, so that their behavior is reliable and predictab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 1999
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(99)00078-8